Decentralized Consensus Optimization With Asynchrony and Delays
نویسندگان
چکیده
منابع مشابه
Decentralized Consensus Optimization with Asynchrony and Delay
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs in a network of agents, where the agents perform local computation and communicate with neighbors. We design our algorithm so that the agents can compute and communicate independently, at different times, for different durations. This reduces the waiting time for the slowest agent or longest commu...
متن کاملRandom Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
In this paper, we address the problem of distributed learning over a decentralized network, arising from scenarios including distributed sensors or geographically separated data centers. We propose a fully distributed algorithm called random walk distributed dual averaging (RW-DDA) that only requires local updates. Our RW-DDA method, improves the existing distributed dual averaging (DDA) method...
متن کاملRandom Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
In this paper, we address the problem of distributed learning over a large number of distributed sensors or geographically separated data centers, which suffer from sampling biases across nodes. We propose an algorithm called random walk distributed dual averaging (RW-DDA) method that only requires local updates and is fully distributed. Our RW-DDA method is robust to the change in network topo...
متن کاملControl Problem for Decentralized Systems with Delays
This paper gives a new solution to the output feedback H2 problem for communication delay patterns specified by a strongly connected graph. A characterization of all stabilizing controllers satisfying the delay constraints is given and the decentralized H2 problem is cast as a convex model matching problem. The main result shows that the model matching problem can be reduced to a finite-dimensi...
متن کاملModel Matching for Decentralized Systems with Delays
This paper gives a new solution to the output feedback H2 model matching problem for a large class of delayed information sharing patterns. Existing methods for similar problems typically reduce the decentralized problem to a centralized problem of higher state dimension. In contrast, this paper demonstrates that the decentralized model matching solution can be constructed from the original cen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2018
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2017.2695121